Orderly Spanning Trees with Applications

Orderly Spanning Trees with Applications

We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning ...

Floor-Planning via Orderly Spanning Trees

Compact Floor-Planning via Orderly Spanning Trees

Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floorplan for any n-node plane triangulation. In comparison with previous floor-planning algorithms in the literature, our solution is not only simpler in the algorithm itself, but also produces floor-plans which require fewer module ...

2 J ul 2 00 1 Orderly Spanning Trees with Applications ∗ Hsueh -

We introduce and study the orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of a plane graph H of G, and an orderly spanning tree of H. We also...

Some Appli ations of Orderly Spanning Trees inGraph Drawing ?